0.00/0.02	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.09/0.41	% Computer : n021.cluster.edu
0.09/0.41	% Model    : x86_64 x86_64
0.09/0.41	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.41	% Memory   : 8046.5625MB
0.09/0.41	% OS       : Linux 6.8.0-71-generic
0.09/0.41	% CPULimit : 1440
0.09/0.41	% WCLimit  : 180
0.09/0.41	% DateTime : Mon Jul 27 11:16:07 UTC 2026
0.09/0.41	% CPUTime  : 
0.09/0.41	Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.09/0.44	Running higher-order theorem proving
0.09/0.45	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.KLaxblnFQJ/E---3.1_696100.p
0.09/0.50	% Version: 3.5.1-ho
0.09/0.50	% Preprocessing class: HSSSSLSSSLSNFFN.
0.09/0.50	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.09/0.50	% Starting lpo6_lambda_fix with 900s (5) cores
0.09/0.50	% Starting post_as_ho8 with 180s (1) cores
0.09/0.50	% Starting post_as_ho3 with 180s (1) cores
0.09/0.50	% Starting post_as_ho2 with 180s (1) cores
0.09/0.50	% post_as_ho3 with pid 696120 completed with status 0
0.09/0.50	% Result found by post_as_ho3
0.09/0.50	% Preprocessing class: HSSSSLSSSLSNFFN.
0.09/0.50	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.09/0.50	% Starting lpo6_lambda_fix with 900s (5) cores
0.09/0.50	% Starting post_as_ho8 with 180s (1) cores
0.09/0.50	% Starting post_as_ho3 with 180s (1) cores
0.09/0.50	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.09/0.50	% No SInE strategy applied
0.09/0.50	% Search class: HGUSF-FFSF22-SFFFMFNN
0.09/0.50	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.09/0.50	% Starting SubtermCWHack with 17s (1) cores
0.09/0.50	% SubtermCWHack with pid 696123 completed with status 0
0.09/0.50	% Result found by SubtermCWHack
0.09/0.50	% Preprocessing class: HSSSSLSSSLSNFFN.
0.09/0.50	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.09/0.50	% Starting lpo6_lambda_fix with 900s (5) cores
0.09/0.50	% Starting post_as_ho8 with 180s (1) cores
0.09/0.50	% Starting post_as_ho3 with 180s (1) cores
0.09/0.50	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.09/0.50	% No SInE strategy applied
0.09/0.50	% Search class: HGUSF-FFSF22-SFFFMFNN
0.09/0.50	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.09/0.50	% Starting SubtermCWHack with 17s (1) cores
0.09/0.50	% Preprocessing time       : 0.002 s
0.09/0.50	
0.09/0.50	% Proof found!
0.09/0.50	% SZS status Theorem
0.09/0.50	% SZS output start CNFRefutation
0.09/0.50	thf(decl_23, type, in: $i > $i > $o).
0.09/0.50	thf(decl_24, type, emptyset: $i).
0.09/0.50	thf(decl_25, type, setadjoin: $i > $i > $i).
0.09/0.50	thf(decl_26, type, setext: $o).
0.09/0.50	thf(decl_27, type, setadjoinIL: $o).
0.09/0.50	thf(decl_28, type, uniqinunit: $o).
0.09/0.50	thf(decl_29, type, eqinunit: $o).
0.09/0.50	thf(decl_30, type, upairset2E: $o).
0.09/0.50	thf(decl_31, type, esk1_2: $i > $i > $i).
0.09/0.50	thf(decl_32, type, esk2_2: $i > $i > $i).
0.09/0.50	thf(decl_33, type, esk3_0: $i).
0.09/0.50	thf(decl_34, type, esk4_0: $i).
0.09/0.50	thf(setukpairinjR11, conjecture, ((setext)=>(((uniqinunit)=>((![X3:$i, X4:$i]:((((setadjoin @ X3 @ (setadjoin @ X4 @ emptyset))=(setadjoin @ X3 @ emptyset))<=((X3)=(X4))))<=(upairset2E))<=(eqinunit)))<=(setadjoinIL))), file('/export/starexec/sandbox/tmp/tmp.KLaxblnFQJ/E---3.1_696100.p', setukpairinjR11)).
0.09/0.50	thf(setext, axiom, ((setext)<=>![X1:$i, X2:$i]:((![X3:$i]:(((in @ X3 @ X1)=>(in @ X3 @ X2)))=>(![X3:$i]:(((in @ X3 @ X2)=>(in @ X3 @ X1)))=>((X1)=(X2)))))), file('/export/starexec/sandbox/tmp/tmp.KLaxblnFQJ/E---3.1_696100.p', setext)).
0.09/0.50	thf(setadjoinIL, axiom, ((setadjoinIL)<=>![X3:$i, X4:$i]:((in @ X3 @ (setadjoin @ X3 @ X4)))), file('/export/starexec/sandbox/tmp/tmp.KLaxblnFQJ/E---3.1_696100.p', setadjoinIL)).
0.09/0.50	thf(uniqinunit, axiom, ((uniqinunit)<=>![X3:$i, X4:$i]:(((in @ X3 @ (setadjoin @ X4 @ emptyset))=>((X3)=(X4))))), file('/export/starexec/sandbox/tmp/tmp.KLaxblnFQJ/E---3.1_696100.p', uniqinunit)).
0.09/0.50	thf(eqinunit, axiom, ((eqinunit)<=>![X3:$i, X4:$i]:((((X3)=(X4))=>(in @ X3 @ (setadjoin @ X4 @ emptyset))))), file('/export/starexec/sandbox/tmp/tmp.KLaxblnFQJ/E---3.1_696100.p', eqinunit)).
0.09/0.50	thf(upairset2E, axiom, ((upairset2E)<=>![X3:$i, X4:$i, X5:$i]:(((in @ X5 @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)))=>(((X5)=(X3))|((X5)=(X4)))))), file('/export/starexec/sandbox/tmp/tmp.KLaxblnFQJ/E---3.1_696100.p', upairset2E)).
0.09/0.50	thf(c_0_6, negated_conjecture, ~(((setext)=>(((uniqinunit)=>((![X3:$i, X4:$i]:((((setadjoin @ X3 @ (setadjoin @ X4 @ emptyset))=(setadjoin @ X3 @ emptyset))<=((X3)=(X4))))<=(upairset2E))<=(eqinunit)))<=(setadjoinIL)))), inference(assume_negation,[status(cth)],[setukpairinjR11])).
0.09/0.50	thf(c_0_7, negated_conjecture, ~((![X21:$i, X22:$i]:((![X23:$i]:(((in @ X23 @ X21)=>(in @ X23 @ X22)))=>(![X24:$i]:(((in @ X24 @ X22)=>(in @ X24 @ X21)))=>((X21)=(X22)))))=>(![X32:$i, X33:$i]:((in @ X32 @ (setadjoin @ X32 @ X33)))=>(![X25:$i, X26:$i]:(((in @ X25 @ (setadjoin @ X26 @ emptyset))=>((X25)=(X26))))=>(![X30:$i, X31:$i]:((((X30)=(X31))=>(in @ X30 @ (setadjoin @ X31 @ emptyset))))=>(![X27:$i, X28:$i, X29:$i]:(((in @ X29 @ (setadjoin @ X27 @ (setadjoin @ X28 @ emptyset)))=>(((X29)=(X27))|((X29)=(X28)))))=>![X3:$i, X4:$i]:((((X3)=(X4))=>((setadjoin @ X3 @ (setadjoin @ X4 @ emptyset))=(setadjoin @ X3 @ emptyset)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6, setext]), setadjoinIL]), uniqinunit]), eqinunit]), upairset2E])])).
0.09/0.50	thf(c_0_8, negated_conjecture, ![X34:$i, X35:$i, X38:$i, X39:$i, X40:$i, X41:$i, X42:$i, X43:$i, X44:$i, X45:$i, X46:$i]:((((((in @ (esk2_2 @ X34 @ X35) @ X35)|((X34)=(X35))|(in @ (esk1_2 @ X34 @ X35) @ X34))&(~(in @ (esk2_2 @ X34 @ X35) @ X34)|((X34)=(X35))|(in @ (esk1_2 @ X34 @ X35) @ X34)))&(((in @ (esk2_2 @ X34 @ X35) @ X35)|((X34)=(X35))|~(in @ (esk1_2 @ X34 @ X35) @ X35))&(~(in @ (esk2_2 @ X34 @ X35) @ X34)|((X34)=(X35))|~(in @ (esk1_2 @ X34 @ X35) @ X35))))&((in @ X38 @ (setadjoin @ X38 @ X39))&((~(in @ X40 @ (setadjoin @ X41 @ emptyset))|((X40)=(X41)))&((((X42)!=(X43))|(in @ X42 @ (setadjoin @ X43 @ emptyset)))&((~(in @ X46 @ (setadjoin @ X44 @ (setadjoin @ X45 @ emptyset)))|(((X46)=(X44))|((X46)=(X45))))&(((esk3_0)=(esk4_0))&((setadjoin @ esk3_0 @ (setadjoin @ esk4_0 @ emptyset))!=(setadjoin @ esk3_0 @ emptyset))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])])).
0.09/0.50	thf(c_0_9, negated_conjecture, ![X1:$i, X2:$i]:((((X1)=(X2))|~((in @ X1 @ (setadjoin @ X2 @ emptyset))))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.09/0.50	thf(c_0_10, negated_conjecture, ![X2:$i, X1:$i]:(((in @ (esk2_2 @ X1 @ X2) @ X2)|((X1)=(X2))|(in @ (esk1_2 @ X1 @ X2) @ X1))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.09/0.50	thf(c_0_11, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((((X1)=(X2))|((X1)=(X3))|~((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)))))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.09/0.50	thf(c_0_12, negated_conjecture, ![X1:$i, X2:$i]:((((esk1_2 @ (setadjoin @ X1 @ emptyset) @ X2)=(X1))|((setadjoin @ X1 @ emptyset)=(X2))|(in @ (esk2_2 @ (setadjoin @ X1 @ emptyset) @ X2) @ X2))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.09/0.50	thf(c_0_13, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((((esk1_2 @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)))=(X1))|((esk2_2 @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)))=(X3))|((esk2_2 @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)))=(X2))|((setadjoin @ X1 @ emptyset)=(setadjoin @ X2 @ (setadjoin @ X3 @ emptyset))))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.09/0.50	thf(c_0_14, negated_conjecture, ![X2:$i, X1:$i]:((((X1)=(X2))|(in @ (esk1_2 @ X1 @ X2) @ X1)|~((in @ (esk2_2 @ X1 @ X2) @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.09/0.50	thf(c_0_15, negated_conjecture, ![X1:$i, X2:$i]:((((esk2_2 @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ X2 @ (setadjoin @ X2 @ emptyset)))=(X2))|((esk1_2 @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ X2 @ (setadjoin @ X2 @ emptyset)))=(X1))|((setadjoin @ X1 @ emptyset)=(setadjoin @ X2 @ (setadjoin @ X2 @ emptyset))))), inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_13])])).
0.09/0.50	thf(c_0_16, negated_conjecture, ![X1:$i, X2:$i]:(((in @ (esk2_2 @ X1 @ X2) @ X2)|((X1)=(X2))|~((in @ (esk1_2 @ X1 @ X2) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.09/0.50	thf(c_0_17, negated_conjecture, ![X1:$i, X2:$i]:((((X1)=(X2))|~((in @ (esk2_2 @ X1 @ X2) @ X1))|~((in @ (esk1_2 @ X1 @ X2) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.09/0.50	thf(c_0_18, negated_conjecture, ![X2:$i, X1:$i]:((((esk1_2 @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ X2 @ (setadjoin @ X2 @ emptyset)))=(X1))|((setadjoin @ X1 @ emptyset)=(setadjoin @ X2 @ (setadjoin @ X2 @ emptyset)))|~((in @ X2 @ (setadjoin @ X1 @ emptyset))))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_9])).
0.09/0.50	thf(c_0_19, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((((esk2_2 @ X1 @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)))=(X3))|((esk2_2 @ X1 @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)))=(X2))|((X1)=(setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)))|~((in @ (esk1_2 @ X1 @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset))) @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)))))), inference(spm,[status(thm)],[c_0_11, c_0_16])).
0.09/0.50	thf(c_0_20, negated_conjecture, ![X2:$i, X1:$i]:((((setadjoin @ X1 @ emptyset)=(setadjoin @ X2 @ (setadjoin @ X2 @ emptyset)))|~((in @ (esk2_2 @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ X2 @ (setadjoin @ X2 @ emptyset))) @ (setadjoin @ X1 @ emptyset)))|~((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X2 @ emptyset))))|~((in @ X2 @ (setadjoin @ X1 @ emptyset))))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.09/0.50	thf(c_0_21, negated_conjecture, ![X2:$i, X1:$i]:((((esk2_2 @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ X2 @ (setadjoin @ X2 @ emptyset)))=(X2))|((setadjoin @ X1 @ emptyset)=(setadjoin @ X2 @ (setadjoin @ X2 @ emptyset)))|~((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X2 @ emptyset))))|~((in @ X2 @ (setadjoin @ X1 @ emptyset))))), inference(spm,[status(thm)],[c_0_19, c_0_18])).
0.09/0.50	thf(c_0_22, negated_conjecture, ((setadjoin @ esk3_0 @ (setadjoin @ esk4_0 @ emptyset))!=(setadjoin @ esk3_0 @ emptyset)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.09/0.50	thf(c_0_23, negated_conjecture, ((esk3_0)=(esk4_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.09/0.50	thf(c_0_24, negated_conjecture, ![X2:$i, X1:$i]:((((setadjoin @ X1 @ emptyset)=(setadjoin @ X2 @ (setadjoin @ X2 @ emptyset)))|~((in @ X1 @ (setadjoin @ X2 @ (setadjoin @ X2 @ emptyset))))|~((in @ X2 @ (setadjoin @ X1 @ emptyset))))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.09/0.50	thf(c_0_25, negated_conjecture, ![X1:$i, X2:$i]:((in @ X1 @ (setadjoin @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.09/0.50	thf(c_0_26, negated_conjecture, ((setadjoin @ esk3_0 @ (setadjoin @ esk3_0 @ emptyset))!=(setadjoin @ esk3_0 @ emptyset)), inference(rw,[status(thm)],[c_0_22, c_0_23])).
0.09/0.50	thf(c_0_27, negated_conjecture, ![X1:$i]:(((setadjoin @ X1 @ (setadjoin @ X1 @ emptyset))=(setadjoin @ X1 @ emptyset))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_25])])).
0.09/0.50	thf(c_0_28, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_27])]), ['proof']).
0.09/0.50	% SZS output end CNFRefutation
0.09/0.50	% Parsed axioms                        : 14
0.09/0.50	% Removed by relevancy pruning/SinE    : 0
0.09/0.50	% Initial clauses                      : 18
0.09/0.50	% Removed in clause preprocessing      : 8
0.09/0.50	% Initial clauses in saturation        : 10
0.09/0.50	% Processed clauses                    : 38
0.09/0.50	% ...of these trivial                  : 0
0.09/0.50	% ...subsumed                          : 3
0.09/0.50	% ...remaining for further processing  : 35
0.09/0.50	% Other redundant clauses eliminated   : 3
0.09/0.50	% Clauses deleted for lack of memory   : 0
0.09/0.50	% Backward-subsumed                    : 4
0.09/0.50	% Backward-rewritten                   : 4
0.09/0.50	% Generated clauses                    : 88
0.09/0.50	% ...of the previous two non-redundant : 55
0.09/0.50	% ...aggressively subsumed             : 0
0.09/0.50	% Contextual simplify-reflections      : 2
0.09/0.50	% Paramodulations                      : 83
0.09/0.50	% Factorizations                       : 2
0.09/0.50	% NegExts                              : 0
0.09/0.50	% Equation resolutions                 : 3
0.09/0.50	% Disequality decompositions           : 0
0.09/0.50	% Total rewrite steps                  : 38
0.09/0.50	% ...of those cached                   : 30
0.09/0.50	% Propositional unsat checks           : 0
0.09/0.50	%    Propositional check models        : 0
0.09/0.50	%    Propositional check unsatisfiable : 0
0.09/0.50	%    Propositional clauses             : 0
0.09/0.50	%    Propositional clauses after purity: 0
0.09/0.50	%    Propositional unsat core size     : 0
0.09/0.50	%    Propositional preprocessing time  : 0.000
0.09/0.50	%    Propositional encoding time       : 0.000
0.09/0.50	%    Propositional solver time         : 0.000
0.09/0.50	%    Success case prop preproc time    : 0.000
0.09/0.50	%    Success case prop encoding time   : 0.000
0.09/0.50	%    Success case prop solver time     : 0.000
0.09/0.50	% Current number of processed clauses  : 26
0.09/0.50	%    Positive orientable unit clauses  : 3
0.09/0.50	%    Positive unorientable unit clauses: 0
0.09/0.50	%    Negative unit clauses             : 0
0.09/0.50	%    Non-unit-clauses                  : 23
0.09/0.50	% Current number of unprocessed clauses: 22
0.09/0.50	% ...number of literals in the above   : 100
0.09/0.50	% Current number of archived formulas  : 0
0.09/0.50	% Current number of archived clauses   : 8
0.09/0.50	% Clause-clause subsumption calls (NU) : 248
0.09/0.50	% Rec. Clause-clause subsumption calls : 139
0.09/0.50	% Non-unit clause-clause subsumptions  : 9
0.09/0.50	% Unit Clause-clause subsumption calls : 15
0.09/0.50	% Rewrite failures with RHS unbound    : 0
0.09/0.50	% BW rewrite match attempts            : 4
0.09/0.50	% BW rewrite match successes           : 2
0.09/0.50	% Condensation attempts                : 0
0.09/0.50	% Condensation successes               : 0
0.09/0.50	% Termbank termtop insertions          : 4512
0.09/0.50	% Search garbage collected termcells   : 412
0.09/0.50	
0.09/0.50	% -------------------------------------------------
0.09/0.50	% User time                : 0.008 s
0.09/0.50	% System time              : 0.003 s
0.09/0.50	% Total time               : 0.011 s
0.09/0.50	% Maximum resident set size: 3636 pages
0.09/0.50	
0.09/0.50	% -------------------------------------------------
0.09/0.50	% User time                : 0.010 s
0.09/0.50	% System time              : 0.005 s
0.09/0.50	% Total time               : 0.015 s
0.09/0.50	% Maximum resident set size: 4864 pages
0.09/0.50	% E exiting
0.21/0.50	EOF